Iterative versionspaces
نویسندگان
چکیده
منابع مشابه
Forgetting and Compacting data in Concept Learning
We investigate some conditions for data to be discarded, independently of the chosen concept learning algorithm or concept representation language. Then an algorithm for discarding data is presented in the framework of Iterative Versionspaces, which is a depth-first algorithm computing versionspaces as introduced by Mitchell. We update the datastructures used in the Iterative Versionspaces algo...
متن کاملWeights in block iterative methods
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...
متن کاملHow Iterative are Iterative Algebras?
Iterative algebras are defined by the property that every guarded system of recursive equations has a unique solution. We prove that they have a much stronger property: every system of recursive equations has a unique strict solution. And we characterize those systems that have a unique solution in every iterative algebra.
متن کاملIteration, Iterative Roots and Iterative Equations
Iteration exists extensively in the nature. Iteration of a homeomorphism generates a dynamical system. To embed such a homeomorphism into a flow we need to define fractional iteration and find iterative roots. The problem of iterative roots is to discuss iterative equations. This is a way to lead us to explore the mathematics of iteration. Iteration is a basic concept in the theory of dynamical...
متن کاملFrom Iterative Algebras to Iterative Theories
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solutions of recursive equations. One of the main results of Elgot and his coauthors is a description of a free iterative theory as the theory of all rational trees. Their algebraic proof of this fact is extremely complicated. In our paper we show that by starting with “iterative algebras”, i. e., algeb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1994
ISSN: 0004-3702
DOI: 10.1016/0004-3702(94)90090-6